A path Turán problem for infinite graphs
نویسندگان
چکیده
منابع مشابه
On the Turán Properties of Infinite Graphs
Let G(∞) be an infinite graph with the vertex set corresponding to the set of positive integers N. Denote by G(l) a subgraph of G(∞) which is spanned by the vertices {1, . . . , l}. As a possible extension of Turán’s theorem to infinite graphs, in this paper we will examine how large lim inf l→∞ |E(G(l))| l2 can be for an infinite graph G(∞), which does not contain an increasing path Ik with k ...
متن کاملAn Ordered Turán Problem for Bipartite Graphs
Let F be a graph. A graph G is F -free if it does not contain F as a subgraph. The Turán number of F , written ex(n, F ), is the maximum number of edges in an F -free graph with n vertices. The determination of Turán numbers of bipartite graphs is a challenging and widely investigated problem. In this paper we introduce an ordered version of the Turán problem for bipartite graphs. Let G be a gr...
متن کاملTurán Problems for Bipartite Graphs ∗
We consider an infinite version of the bipartite Turán problem. Let G be an infinite graph with V (G) = N, and let Gn be the n-vertex subgraph of G induced by the vertices {1, 2, . . . , n}. We show that if G is K2,t+1-free, then for infinitely many n, e(Gn) ≤ 0.471 √ tn3/2. Using the K2,t+1-free graphs constructed by Füredi, we construct an infinite K2,t+1-free graph with e(Gn) ≥ 0.23 √ tn3/2 ...
متن کاملA Turán Theorem for Random Graphs Dean of the Graduate School Date a Turán Theorem for Random Graphs a Turán Theorem for Random Graphs
of a thesis submitted to the Faculty of the Graduate School of Emory University in partial fulfillment of the requirements of the degree of Master of Science Department of Mathematics and Computer Science
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.08.019